FindIndependentVertexSet

FindIndependentVertexSet[g] finds an independent vertex set of the graph g with a maximum number of vertices.

FindIndependentVertexSet[g,n] finds an independent vertex set with at most n vertices.

FindIndependentVertexSet[g,{n}] finds an independent vertex set with exactly n vertices.

FindIndependentVertexSet[g,{nmin,nmax}] finds an independent vertex set containing between nmin and nmax vertices.

FindIndependentVertexSet[g,nspec,s] finds at most s independent vertex sets.

FindIndependentVertexSet[{g,v},…] finds independent sets that include the vertex v only.

FindIndependentVertexSet[{v->w,…},…] uses rules v->w to specify the graph g.

Please visit the official Wolfram Language Reference for more details and examples on core symbols.